Reformulating Propositional Satisfiability as Constraint Satisfaction
نویسنده
چکیده
We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent mappings of SAT problems into CSPs. For each mapping , we compare theoretically the performance of systematic algorithms like FC and MAC applied to the encoding against the Davis-Putnam procedure applied to the original SAT problem. We also compare local search methods like GSAT and WalkSAT on a SAT problem against the Min-Connicts procedure applied to its encoding. Finally, we look at the special case of local search methods applied to 2-SAT problems and encodings of 2-SAT problems. Our results provide insight into the relationship between propositional satissability and constraint satisfaction, as well as some of the potential beneets of reformulating problems as constraint satisfaction problems.
منابع مشابه
Reformulating Propositional Satissability as Constraint Satisfaction
We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent mappings of SAT problems into CSPs. For each mapping , we compare theoretically the performance of systematic algorithms like FC and MAC applied to the encoding against the Davis-Putnam procedure applied to the original SAT problem. We also compare loc...
متن کاملAn Empirical Measure for Characterizing 3-SAT
The literal encoding of the satisfiability problem (SAT) as a binary constraint satisfaction problem (CSP) allows us to make a technical comparison between the propositional logic and the constraint network fields. Equivalencies or analogies between concepts and techniques used in the two fields are then shown. For instance it is shown that arc consistency is equivalent to unit resolution [7, 2...
متن کاملConstraint Methods for Modal Satisfiability
Modal and modal-like formalisms such as temporal or description logics go beyond propositional logic by introducing operators that allow for a guarded form of quantification over states or paths of transition systems. Thus, they are more expressive than propositional logic, yet computationally better behaved than first-order logic. We propose constraint-based methods to model and solve modal sa...
متن کاملTutorial Presentations at the Twelfth International Conference on Principles of Knowledge Representation and Reasoning
Constraint satisfaction problems arise in many diverse areas including software and hardware verification, type inference, extended static checking, test-case generation, scheduling, planning, graph problems, among others. The most well-known constraint satisfaction problem is propositional satisfiability SAT. Of particular recent interest is satisfiability modulo theories (SMT), where the inte...
متن کاملComplete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search algorithms are notoriously incomplete: They are not guaranteed to find a feasible solution if one exists and they cannot be used to determine unsatisfiability. We present an algorithmic framework for complete local sear...
متن کامل